The Criterion of Empirical Significance: Endgame

نویسنده

  • Ken Gemes
چکیده

Any precise version of H-D needs to handle various problems, most notably, the problem of selective confirmation: Precise formulations of H-D should not have the consequence that where S confirms T, for any T', S confirms T&T'. It is the perceived failure of H-D to solve such problems that has lead John Earman to recently conclude that H-D is "very nearly a dead horse". This suggests the following state of play: H-D is an intuitively plausible idea that breaks down in the attempt to give it a precise formulation. Indeed I think that fairly captures the view among specialists in the field of confirmation theory. Here I argue that the truth about H-D is largely the reverse: H-D can be given a precise formulation that avoids the longstanding technical problems, however, it relies on a fundamentally unsound philosophical intuition. The bulk of this paper involves reviewing the problems affecting previous attempts at giving precise formulations of H-D and displaying some recent versions that can handle these problems. It then briefly explains why the basic intuition behind H-D is itself unsound, namely, because H-D involves a tacit assumption of inductive scepticism. Finally, the historical relation between H-D and the positivists' quest for a criterion of empirical significance will be reconsidered with the surprising result that having glossed H-D as fundamentally unsound it is concluded that a sound version of the criterion of empirical significance is now available. The demarcation criterion, the positivists' philosopher's stone that serves to separate claims with empirical significance from claims lacking empirical significance having finally been found, it is argued that we should regard empirical significance as just one among a variety of virtues and not follow the positivists in taking it to be a sin qua non for all meaningful statements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New empirical failure criterion for shale

A new failure criterion was presented to predict the ultimate strength of shale under the triaxial and polyaxial state of stress. A database containing 93 datasets was obtained from the results of the uniaxial, triaxial, polyaxial compressive tests, an indirect tensile test was collected from reliable references, and this test was carried out on the shale samples taken from the southwestern oil...

متن کامل

Search versus Knowledge: An Empirical Study of Minimax on KRK

This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax algorithm on the evaluation function. The experiment’s simulations were performed upon the KRK chess endgame. Our results show that dependencies between evaluations of sibling nodes in a game tree and an abundance of possibilities to commit blunders present in the KRK end...

متن کامل

Carnap on empirical significance

Carnap’s search for a criterion of empirical significance is usually considered a failure. I argue that the results from two out of his three different approaches are at the very least problematic, but that one approach led to success. Carnap’s criterion of translatability into logical syntax is too vague to allow for definite results. His criteria for terms—introducibility by chains of reducti...

متن کامل

Search Vs Knowledge: Empirical Study of Minimax on Krk Endgame

This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax on the evaluation function. The experiment’s simulations were performed upon the KRK chess endgame. Main result is that dependencies between evaluations of sibling nodes in a game tree and an abundance of possibilities to commit blunders present in the KRK endgame are not...

متن کامل

Searching for Better Performance on the King-Rook-King Chess Endgame Problem

For many classification problems, genetic algorithms prove to be effective without extensive domain engineering. However, the chess King-Rook-King endgame problem appears to be an exception. We explore whether modifications to a baseline parallel genetic algorithm can improve the accuracy on this particular problem. After describing the problem domain and our implementation of a parallel geneti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005